- disjoint polygon
- внешний многоугольник
Англо-русский словарь промышленной и научной лексики. 2014.
disjoint polygon
Смотреть что такое "disjoint polygon" в других словарях:
GPC General Polygon Clipper Library — The University of Manchester GPC library is a software library providing an API for computing the results of clipping operations on sets of polygons. It generalises the computer graphics clipping problem of intersecting polygons with polygons.The … Wikipedia
Edge coloring — A 3 edge coloring of the Desargues graph. In graph theory, an edge coloring of a graph is an assignment of “colors” to the edges of the graph so that no two adjacent edges have the same color. For example, the figure to the right shows an edge… … Wikipedia
Solid modeling — The geometry in solid modeling is fully described in 3‑D space; objects can be viewed from any angle. Modeled and ray traced in Cobalt Solid modeling (or modelling) is a consistent set of principles for mathematical and computer modeling of three … Wikipedia
Surface — This article discusses surfaces from the point of view of topology. For other uses, see Differential geometry of surfaces, algebraic surface, and Surface (disambiguation). An open surface with X , Y , and Z contours shown. In mathematics,… … Wikipedia
120-cell — Schlegel diagram (vertices and edges) Type Convex regular 4 polytope Schläfli symbol {5,3,3} … Wikipedia
Point location — The point location problem is a fundamental topic of computational geometry. It finds applications in areas that deal with processing geometrical data: computer graphics, geographic information systems (GIS), motion planning, and computer aided… … Wikipedia
Banach–Tarski paradox — The Banach–Tarski paradox is a theorem in set theoretic geometry which states that a solid ball in 3 dimensional space can be split into several non overlapping pieces, which can then be put back together in a different way to yield two identical … Wikipedia
Minkowski addition — The red figure is the Minkowski sum of blue and green figures. In geometry, the Minkowski sum (also known as dilation) of two sets A and B in Euclidean space is the result of adding every element of … Wikipedia
Fractional cascading — In computer science, fractional cascading is a technique to speed up a sequence of binary searches for the same value in a sequence of related data structures. The first binary search in the sequence takes a logarithmic amount of time, as is… … Wikipedia
Evenness of zero — The number 0 is even. There are several ways to determine whether an integer is even or odd, all of which indicate that 0 is an even number: it is a multiple of 2, it is evenly divisible by 2, it is surrounded on both sides by odd integers, and… … Wikipedia
Simplex — For other uses, see Simplex (disambiguation). A regular 3 simplex or tetrahedron In geometry, a simplex (plural simplexes or simplices) is a generalization of the notion of a triangle or tetrahedron to arbitrary dimension. Specifically, an n… … Wikipedia
